T-functions revisited: new criteria for bijectivity/transitivity

نویسندگان

  • Vladimir Anashin
  • Andrei Khrennikov
  • Ekaterina Yurova
چکیده

The paper presents new criteria for bijectivity/transitivity of Tfunctions and fast knapsack-like algorithm of evaluation of a T-function. Our approach is based on non-Archimedean ergodic theory: Both the criteria and algorithm use van der Put series to represent 1-Lipschitz p-adic functions and to study measure-preservation/ergodicity of these.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The function ring functors of pointfree topology revisited

This paper establishes two new connections between the familiar function ring functor ${mathfrak R}$ on the category ${bf CRFrm}$ of completely regular frames and the category {bf CR}${mathbf sigma}${bf Frm} of completely regular $sigma$-frames as well as their counterparts for the analogous functor ${mathfrak Z}$ on the category {bf ODFrm} of 0-dimensional frames, given by the integer-valued f...

متن کامل

On Some New Forms of Cycle-Transitivity and Their Relation to Commutative Copulas

Recently, we introduced the framework of cycletransitivity as a general means of representing transitivity conditions on reciprocal relations. In this framework, for reciprocal relations, the concepts of T -transitivity and stochastic transitivity can be cast. The upper bound functions encountered in this framework for product-transitivity and dice-transitivity, conceptually related to the prob...

متن کامل

SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

متن کامل

Some Generalizations of the Manipulability of Fuzzy Social Choice Functions

This paper presents some generalizations of the Gibbard -Satterthwaite result (1973, 1975) for fuzzy preference relations. It explores the implication of weakening the transitivity condition of the Ben Abdealziz et al.’s (2008) fuzzy manipulability concept. For this purpose, the max-min transitivity is replaced by weaker transitivity: the max-?-transitivity, where ? is a t-norm. In addition, th...

متن کامل

Studies in Partitions and Permutations

This work is divided into three related but self-contained parts. In the first part an inversion theorem similar to M6bius inversion is derived for the set of partitions of the integer n partially ordered by the dominance ordering. This theorem is then used to obtain a purely combinatorial derivation of the irreducible characters of the symmetric group Sn, to obtain results about symmetric func...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 71  شماره 

صفحات  -

تاریخ انتشار 2014